A Preconditioned Gmres Method for Nonsymmetric or Indefinite Problems
نویسندگان
چکیده
A preconditioning technique is proposed for nonsymmetric or indefinite linear systems of equations. The main idea in our theory, roughly speaking, is first to use some "coarser mesh" space to correct the nonpositive portion of the eigenvalues of the underlying operator and then switch to use a symmetric positive definite preconditioner. The generality of our theory allows us to apply any known preconditioners that were orginally designed for symmetric positive definite problems to nonsymmetric or indefinite problems, without losing the optimality that the original one has. Some numerical experiments based on GMRES are reported.
منابع مشابه
On a Non-stagnation Condition for Gmres and Application to Saddle Point Matrices
In Simoncini and Szyld [Numer. Math., 109 (2008), pp. 477–487] a new non-stagnation condition for the convergence of GMRES on indefinite problems was proposed. In this paper we derive an enhanced strategy leading to a more general non-stagnation condition. Moreover, we show that the analysis also provides a good setting to derive asymptotic convergence rate estimates for indefinite problems. Th...
متن کاملFurther improvements in nonsymmetric hybrid
In the past few years new methods have been proposed that can be seen as combinations of standard Krylov subspave methods, such as Bi{ CG and GMRES. One of the rst hybrid schemes of this type is CGS, actually the Bi{CG squared method. Other such hybrid schemes include BiCGSTAB (a combination of Bi{CG and GMRES(1)), QMRS, TFQMR, Hybrid GMRES (polynomial preconditioned GMRES) and the nested GMRES...
متن کاملA comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems
In recent years competitive domain decomposed preconditioned iterative tech niques have been developed for nonsymmetric elliptic problems In these tech niques a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow e ective solution on parallel machines A central question is how to choose these small problems and how to arrange the or...
متن کاملA Preconditioned Recycling GMRES Solver for Stochastic Helmholtz Problems
We present a parallel Schwarz type domain decomposition preconditioned recycling Krylov subspace method for the numerical solution of stochastic indefinite elliptic equations with two random coefficients. Karhunen-Loève expansions are used to represent the stochastic variables and the stochastic Galerkin method with double orthogonal polynomials is used to derive a sequence of uncoupled determi...
متن کاملBDDC for Nonsymmetric Positive Definite and Symmetric Indefinite Problems
The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992